/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-08-12
 * Time: 23:49
 */
class Solution5 {
    int[] tmp;
    public int[] sortArray(int[] nums) {
        tmp = new int[nums.length];
        mergeSort(nums,0,nums.length-1);
        return nums;
    }

    public void mergeSort(int[] nums, int left, int right) {
        if(left >= right) {
            return;
        }

        // 1.中间划分
        int mid = (left+right)/2;
        // 2.按照区域划分
        mergeSort(nums,left,mid);
        mergeSort(nums,mid+1,right);
        //3.合并
        int cur1 = left, cur2 = mid+1, i = 0;

        while(cur1 <= mid && cur2 <= right) {
            tmp[i++] = nums[cur1] <= nums[cur2] ? nums[cur1++] : nums[cur2++];
        }
        while(cur1 <= mid) {
            tmp[i++] = nums[cur1++];
        }
        while(cur2 <= right) {
            tmp[i++] = nums[cur2++];
        }
        // 4.还原
        for(int j = left; j <= right; j++) {
            nums[j] = tmp[j-left];
        }
    }
}
